Rectilinear paths with minimum segment lengths
نویسندگان
چکیده
منابع مشابه
3D rectilinear motion planning with minimum bend paths
Computing rectilinear shortest paths in two dimensions has been solved optimally using a number of different techniques. A variety of related problems have been solved, including minimizing the number of bends in the path, the total rectilinear distance, or some combination of both. However, solutions to the 3D versions of these problems are less common. We propose a solution to the 3D minimum-...
متن کاملPaths with Minimum Range and Ratio of Arc Lengths
Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex 1 with the smallest possible range of arc lengths. and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of these problems are also considered. Ke_vwords: Bicriterion paths; Range; Ratio
متن کاملRectilinear Paths among Rectilinear Obstacles
Given a set of obstacles and two distinguished points in the plane the problem of nding a collision free path subject to a certain optimization function is a fundamental problem that arises in many elds, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinea...
متن کاملAn Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains
We consider the problem of finding minimum-link rectilinear paths in rectilinear polygonal domains in the plane. A path or a polygon is rectilinear if all its edges are axis-parallel. Given a set P of h pairwise-disjoint rectilinear polygonal obstacles with a total of n vertices in the plane, a minimumlink rectilinear path between two points is a rectilinear path that avoids all obstacles with ...
متن کاملRectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods
We consider a setting where we are given a graph G = (R, E), where R = {R1, . . . , Rn} is a set of polygonal regions in the plane. Placing a point pi inside each region Ri turns G into an edge-weighted graph Gp , p = {p1, . . . , pn}, where the cost of (Ri, Rj) ∈ E is the distance between pi and pj . The Shortest Path Problem with Neighborhoods asks, for given Rs and Rt, to find a placement p ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.12.003